Nash Equilibria in Concurrent Priced Games
نویسندگان
چکیده
Concurrent game structures model multi-player games played on finite graphs where the players simultaneously choose their moves and collectively determine the next state of the game. We extend this model with prices on transitions for each player. We study pure Nash equilibria in this framework where each player’s payoff is the accumulated price of all transitions until reaching their goal state. We provide a construction of a Büchi automaton accepting all Nash equilibria outcomes and show how this construction can be used to solve a variety of related problems, such as finding pareto-optimal equilibria. Furthermore, we prove the problem of deciding the existence of equilibria to be NP-complete.
منابع مشابه
Nash Equilibria for Reachability Objectives in Multi-player Timed Games
We propose a procedure for computing Nash equilibria in multi-player timed games with reachability objectives. Our procedure is based on the construction of a finite concurrent game, and on a generic characterization of Nash equilibria in (possibly infinite) concurrent games. Along the way, we use our characterization to compute Nash equilibria in finite concurrent games.
متن کاملPRALINE: A Tool for Computing Nash Equilibria in Concurrent Games
We present PRALINE, which is the first tool to compute Nash equilibria in games played over graphs. We consider concurrent games: at each step, players choose their actions independently. There can be an arbitrary number of players. The preferences of the players are given by payoff functions that map states to integers, the goal for a player is then to maximize the limit superior of her payoff...
متن کاملMarginal cost pricing for Atomic Network Congestion Games
We study optimal tolls for network congestion games where players aim to route certain amount of traffic between various source destination pairs. We consider weighted atomic users, unsplittable traffic and arbitrary nondecreasing latency functions. Users are selfish and want to follow routes that minimize their respective latencies. We focus on pure Nash equilibria. A Nash equilibrium profile ...
متن کاملThe Complexity of Nash Equilibria in Limit-Average Games
We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in randomised strategies is undecidable, while the existence of a Nash equilibrium in pure strategies is decidable, even if we put a constraint on the payoff of the equilibrium. Our undecidability result holds even for a res...
متن کاملStochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games
We study the existence of mixed-strategy equilibria in concurrent games played on graphs. While existence is guaranteed with safety objectives for each player, Nash equilibria need not exist when players are given arbitrary terminal-reward objectives, and their existence is undecidable with qualitative reachability objectives (and only three players). However, these results rely on the fact tha...
متن کامل